/**
*      author: Y_Yao
*      created: 2024-10-31 20:44:36
**/

#include<bits/stdc++.h>

using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
int n;
int b[101];

void solve()
{

    memset(b,0,sizeof b);
    cin >> n;
    int a[n];
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        b[a[i]]++;
    }
    int ret = INF;
    int flag = 0;
    for(int i = 0;i <= 100;i++)
    {
        if(b[i] >= 3)
        {
            flag = 1;
            ret = min(ret,i * 3);
        }
    }
    if(flag == 0)
    {
        cout << "no" << endl;
    }
    else
    {
        cout << "yes" << endl;
        cout << ret << endl;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}